Contrast invariant image intersection
نویسندگان
چکیده
Given two images of the same scene taken at diierent times or with diierent cameras, we propose an "image intersection" method. Contrast invariant image intersection permits to generate a new image which does not depend upon the contrast of the cameras or the overall diierences in illumination of the scene at diierent times. We call section of a digital image u(x) any connected component of a bilevel set fx; u(x) g. The sections are contrast invariant features of an image. The proposed method starts with two registered digital images 1 and 2 and constructs two intersection images, that is, a subimage of Image 1 whose sections are present in Image 2 and a subimage of Image 2 whose sections are present in Image 1.
منابع مشابه
A New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA
Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...
متن کاملRobust and Fully Automated Image Registration Using Invariant Features
This paper introduces a novel method for affine invariant matching using Zwickels that is especially well suited for images of man-made structures. Zwickels are sections defined by two intersecting line segments, dividing the neighborhood around the intersection point into two sectors. The information inside the smaller sector is used to compute an affine invariant representation. We rectify th...
متن کاملPure homology of algebraic varieties
We show that for a complete complex algebraic variety the pure term of the weight filtration in homology coincides with the image of intersection homology. Therefore pure homology is topologically invariant. To obtain slightly more general results we introduce image homology for noncomplete varieties.
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملDetection of Copy-Move Forgery in Digital Images Using Scale Invariant Feature Transform Algorithm and the Spearman Relationship
Increased popularity of digital media and image editing software has led to the spread of multimedia content forgery for various purposes. Undoubtedly, law and forensic medicine experts require trustworthy and non-forged images to enforce rights. Copy-move forgery is the most common type of manipulation of digital images. Copy-move forgery is used to hide an area of the image or to repeat a por...
متن کامل